An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
نویسندگان
چکیده
This paper de nes and studies an approximation algorithm for scheduling tasks with small communication delays onm processors. In a rst step, a schedule 1 for the problem instance with an unlimited number of processors is generated with a polynomial algorithm with relative performance bounded by 2(1 + ) 2 + , where denotes the ratio between the greatest communication delay and the smallest processing time. Then this solution is used to solve the resource con icts during the scheduling phase on m processors, with a rather unusual feature: a processor may remain idle even if some tasks are feasible in order to wait for a more important task. The schedule generated by this algorithm is proved to have an overall worst case performance 4 + 3 2 + 2 + 2 (2 + )m , improving the best known ratio 2 + 2 m .
منابع مشابه
Scheduling in and Out Forests in the Presence of Communication Delays
We consider the problem of scheduling tasks on multiprocessor architectures in the presence of communication delays. Given a set of dependent tasks, the scheduling problem is to allocate the tasks to processors such that the pre-specified precedence constraints among the tasks are obeyed and certain cost-measures (such as the computation time) are minimized. Several cases of the scheduling prob...
متن کاملScheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation
In the last few years, multi-processor scheduling with interprocessor communication delays has received increasing attention. This is due to the more realistic constraints in modeling parallel processor systems. Most research in this vein is concerned with the makespan criterion. We contribute to this work by presenting a new and simple ( 2 1)-approximation algorithm for scheduling to minimize ...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملScheduling Tasks and Communications on a Hierarchical System with Message Contention
A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 108 شماره
صفحات -
تاریخ انتشار 2001